A Genetic Algorithm based Solution to the Teaching Assignment Problem

نویسندگان

  • Ian David Wilson
  • Ross Davies
  • Nigel Stanton
چکیده

Allocation of educators to diverse and rapidly evolving educational programmes of study such as those within Computing and under increasingly tighter budgetary constraints is a non-trivial task. Suitability and availability of expertise coupled with a need to limit disruption to existing teaching assignments can often result in first fit solutions that are less than optimal in terms of suitability. This system is highly sensitive to even small changes, which ripple out through assignments and make it a difficult problem for solution. This paper presents a methodology for profiling programmes of study and, by association, educator expertise that provides a basis for exploring a large number of potential teaching assignments utilising a genetic algorithm. The teaching assignment problem is exponential in problem size and is combinatorially large. Here, a genetic algorithm implementation generates teaching assignments and informs management decision making for continuity planning. The process rapidly achieved very good solutions to a difficult problem, informed scheduling for the coming academic year and determined the acquisition of educators from other areas where local expertise was insufficient for needs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A population-based algorithm for the railroad blocking problem

Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assemble...

متن کامل

A genetic algorithm for a bi-objective mathematical model for dynamic virtual cell formation problem

Nowadays, with the increasing pressure of the competitive business environment and demand for diverse products, manufacturers are force to seek for solutions that reduce production costs and rise product quality. Cellular manufacturing system (CMS), as a means to this end, has been a point of attraction to both researchers and practitioners. Limitations of cell formation problem (CFP), as one o...

متن کامل

Load Frequency Control in Power Systems Using Multi Objective Genetic Algorithm & Fuzzy Sliding Mode Control

This study proposes a combination of a fuzzy sliding mode controller (FSMC) with integral-proportion-Derivative switching surface based superconducting magnetic energy storage (SMES) and PID tuned by a multi-objective optimization algorithm to solve the load frequency control in power systems. The goal of design is to improve the dynamic response of power systems after load demand changes. In t...

متن کامل

Locomotive assignment problem with train precedence using genetic algorithm

This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

A Honey Bee Algorithm To Solve Quadratic Assignment Problem

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013